Handwriting Biometric Hash Attack: A Genetic Algorithm with User Interaction for Raw Data Reconstruction
نویسندگان
چکیده
Biometric Hash algorithms, also called BioHash, are mainly designed to ensure template protection to its biometric raw data. To assure reproducibility, BioHash algorithms provide a certain level of robustness against input variability to ensure high reproduction rates by compensating for intra-class variation of the biometric raw data. This concept can be a potential vulnerability. In this paper, we want to reflect such vulnerability of a specific Biometric Hash algorithm for handwriting, which was introduced in [1], consider and discuss possible attempts to exploit these flaws. We introduce a new reconstruction approach, which exploits this vulnerability; to generate artificial raw data out of a reference BioHash. Motivated by work from Cappelli et al. for fingerprint modality in [6] further studied in [3], where such an artificially generated raw data has the property of producing false positive recognitions, although they may not necessarily be visually similar. Our new approach for handwriting is based on genetic algorithms combined with user interaction in using a design vulnerability of the BioHash with an attack corresponding to cipher-text-only attack with side information as system parameters from BioHash. To show the general validity of our concept, in first experiments we evaluate using 60 raw data sets (5 individuals overall) consisting of two different handwritten semantics (arbitrary Symbol and fixed PIN). Experimental results demonstrate that reconstructed raw data produces an EERreconstr. in the range from 30% to 75%, as compared to non-attacked interclass EERinter-class of 5% to 10% and handwritten PIN semantic can be better reconstructed than the Symbol semantic using this new technique. The security flaws of the Biometric Hash algorithm are pointed out and possible countermeasures are proposed.
منابع مشابه
Feature Selection by User Specific Feature Mask on a Biometric Hash Algorithm for Dynamic Handwriting
One of the most important requirements on a biometric verification system, beside others (e.g. biometric template protection), is a high user authentication performance. During the last years a lot of research is done in different domains to improve user authentication performance. In this work we suggest a user specific feature mask vector MV applied on a biometric hash algorithm for dynamic h...
متن کاملFeature Selection on Handwriting Biometrics: Security Aspects of Artificial Forgeries
A lot of improvements were introduced lately in order to increase the verification performance of biometric user authentication systems. One method, besides many others, is the selection of specific features for each user during the verification process. In this paper we present a security analysis of a user specific bit mask vector, which was originally introduced to improve verification perfo...
متن کاملBiometric hashing for handwriting: entropy-based feature selection and semantic fusion
Some biometric algorithms lack of the problem of using a great number of features, which were extracted from the raw data. This often results in feature vectors of high dimensionality and thus high computational complexity. However, in many cases subsets of features do not contribute or with only little impact to the correct classification of biometric algorithms. The process of choosing more d...
متن کاملThe Effectiveness of Generative Attacks on an Online Handwriting Biometric
The traditional approach to evaluating the performance of a behavioral biometric such as handwriting or speech is to conduct a study involving human subjects (näıve and/or skilled “forgers”) and report the system’s False Reject Rate (FRR) and False Accept Rate (FAR). In this paper, we examine a different and perhaps more ominous threat: the possibility that the attacker has access to a generati...
متن کاملMultimodal Biometrics for Voice and Handwriting
In this paper a novel fusion approach for combining voice and online signature verification will be introduced. While the matching algorithm for the speaker identification modality is based on a single Gaussian Mixture Model (GMM) algorithm, the signature verification strategy is based on four different distance measurement functions, combined by multialgorithmic fusion. Together with a feature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010